Algorithms Lecture thesection: Approximation Algorithms [Fa’13] Le mieux est l’ennemi du bien. [The best is the enemy of the good.] — Voltaire, La Bégueule (1772)

Source URL: web.engr.illinois.edu

• NP-complete problems
• Approximation algorithm
• Vertex cover
• Travelling salesman problem
• Graph coloring
• Metric k-center
• Dynamic programming
• Christofides algorithm
• Set cover problem
• Theoretical computer science
• Mathematics
• Computational complexity theory

informs MATHEMATICS OF OPERATIONS RESEARCH Vol. 00, No. 0, Xxxxxx 20xx, pp. xxx–xxx ISSN 0364-765X | EISSN |xx|0000|0xxx

Source URL: www.cs.technion.ac.il

• Operations research
• Submodular set function
• Computational complexity theory
• Linear programming
• Randomized rounding
• Continuous function
• Optimization problem
• Mathematical optimization
• Time complexity
• Theoretical computer science
• Mathematics
• Applied mathematics

R E ACT ! An Interactive Tool for Hybrid Planning in Robotics Zeynep Dogmus, Volkan Patoglu and Esra Erdem Faculty of Engineering and Natural Sciences, Sabancı University, ˙Istanbul, Turkey Email: {zeynepdogmus,vpatogl

Source URL: faculty.cua.edu

• Logic programming
• Automated planning and scheduling
• Formal methods
• Reasoning
• Action description language
• Answer set programming
• Action language
• Algorithm
• Boolean satisfiability problem
• Theoretical computer science
• Applied mathematics
• Artificial intelligence

CCCG 2011, Toronto ON, August 10–12, 2011 Enumerating Minimal Transversals of Geometric Hypergraphs Khaled Elbassioni∗ Imran Rauf†

Source URL: 2011.cccg.ca

• NP-complete problems
• Algorithm
• Set cover problem
• Polynomial
• Vertex cover
• Matroid
• Mathematics
• Hypergraph
• Applied mathematics

CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 The Maximum Disjoint Set of Boundary Rectangles AmirMahdi AhmadiNejad∗ Hamid Zarrabi-Zadeh∗

Source URL: www.cccg.ca

• Discrete geometry
• Packaging
• Packing problem
• Rectangle
• Approximation algorithm
• Algorithm
• Mathematics
• Geometry
• Theoretical computer science

MUMS Problem of the Week #2 How many rectangles (including squares) are on a chessboard? Solution to #1: Consider the sets . By the Pigeonhole Principle, two of their sums must be congruent moduloTheir set differ

Source URL: www.ms.unimelb.edu.au

16th Canadian Conference on Computational Geometry, 2004 ˝ A remark on the Erdos–Szekeres theorem Adrian Dumitrescu

Source URL: www.cccg.ca

• Discrete geometry
• Convex analysis
• Euclidean plane geometry
• Ramsey theory
• Convex hull
• Convex set
• Polygon
• Happy Ending problem
• Convex function
• Geometry
• Mathematics
• Convex geometry

ICS 260 – Fall 2001 – Final Exam Name: Student ID: 1:

Source URL: www.ics.uci.edu

• Complexity classes
• NP-complete problems
• Mathematical optimization
• Operations research
• Travelling salesman problem
• NP
• Induced path
• Independent set
• Directed acyclic graph
• Theoretical computer science
• Graph theory
• Computational complexity theory

Astro 321: Problem Set 3 Due JanProblem 1: Angular Scale of the Horizon

Source URL: background.uchicago.edu

• Space
• Cosmic microwave background radiation
• Horizon problem
• Deuterium
• Age of the universe
• Universe
• Cosmic neutrino background
• Lambda-CDM model
• Physical cosmology
• Physics
• Astronomy

Astro 305: Problem Set 2 Due OctoberScattering Damping

Source URL: background.uchicago.edu

• Atomic physics
• Explorer program
• Space telescopes
• Cosmic microwave background radiation
• Reionization
• Wilkinson Microwave Anisotropy Probe
• Isotropy
• Radiative transfer
• Scattering
• Physics
• Physical cosmology
• Orientation